منابع مشابه
Every Monotone 3-Graph Property is Testable
Let k ≥ 2 be a fixed integer and P be a property of k-uniform hypergraphs. In other words, P is a (typically infinite) family of k-uniform hypergraphs and we say a given hypergraph H satisfies P if H ∈ P . For a given constant η > 0 a k-uniform hypergraph H on n vertices is η-far from P if no hypergraph obtained from H by changing (adding or deleting) at most ηn edges in H satisfies P . More pr...
متن کاملEvery Property of Outerplanar Graphs is Testable
A D-disc around a vertex v of a graph G = (V,E) is the subgraph induced by all vertices of distance at most D from v. We show that the structure of an outerplanar graph on n vertices is determined, up to modification (insertion or deletion) of at most n edges, by a set of D-discs around the vertices, for D = D( ) that is independent of the size of the graph. Such a result was already known for ...
متن کاملEvery Monotone Graph Property Has a Sharp Threshold Ehud Friedgut and Gil Kalai
In their seminal work which initiated random graph theory Erd os and R enyi discovered that many graph properties have sharp thresholds as the number of vertices tends to in nity We prove a conjecture of Linial that every monotone graph property has a sharp threshold This follows from the following theorem Let Vn p f g denote the Hamming space endowed with the probability measure p de ned by p ...
متن کاملEvery Property Is Testable on a Natural Class of Scale-Free Multigraphs
In this paper, we introduce a natural class of multigraphs, Hierarchical-Scale-Free (HSF, in short), and consider constant-time testability on the class. We show that a very wide subclass, i.e., the power-low exponent is greater than two, of HSF is hyperfinite. Based on this result, an algorithm of deterministic partitioning oracle can be constructed. And finally we show that every property is ...
متن کاملEvery class of $S$-acts having a flatness property is closed under directed colimits
Let $S$ be a monoid. In this paper, we prove every class of $S$-acts having a flatness property is closed underdirected colimits, it extends some known results. Furthermore thisresult implies that every $S$-act has a flatness cover if and only if it has a flatness precover.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/050633445